منابع مشابه
Simplest random K-satisfiability problem
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of gammaN random boolean constraints which are to be satisfied simultaneously by N logical variables. In statistical-mechanics language, the considered model can be seen as a diluted p-spin model at zero temperature. While such problems become extraordinarily hard to solve by local s...
متن کاملCritical Behavior in the Satisfiability of Randomk-horn Formulae
GABRIEL ISTRATE Abstract. We determine the asymptotical satisfiability probability of a random at-most-k-Horn formula, via a probabilistic analysis of a simple version, called PUR, of positive unit resolution. We show that for k = k(n) ! 1 the problem can be “reduced” to the case k(n) = n, that was solved in [12]. On the other hand, in the case k = constant the behavior of PUR is modeled by a s...
متن کاملThe Inverse Satisfiability Problem
We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF). We also prove a dichotomy theorem analogous to the classical one by Schaefer, stating tha...
متن کاملThe Minimum Satisfiability Problem
This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst-case and average-case performances of greedy and probabilistic greedy heuristics for the problem are examined, and tight upper bounds on the performance ratio in each case are developed. K...
متن کاملThe inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each “clause” is an or -list of inequalities in n variables. The inequality satisfiability problem (I-SAT) is to find whether there exists a feasible point in <n that satisfies at least one inequality in each “clause”. We show that I-SAT is harder than SAT in that I-SAT is NP-complete even when restricted to contain only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2001
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.63.026702